-
1 fast Hartley transform
Техника: быстрое преобразование ХартлиУниверсальный англо-русский словарь > fast Hartley transform
-
2 fast Hartley transform
Engineering: FHTУниверсальный русско-английский словарь > fast Hartley transform
-
3 fast Hartley transform
быстрое преобразование Хартли, БПХEnglish-Russian electronics dictionary > fast Hartley transform
-
4 transform
1) преобразование; отображение || преобразовывать(ся); отображать(ся)2) результат преобразования; образ; отображение3) трансформация; превращение; переход || трансформировать(ся); превращать(ся); переходить•- chirp-Z transform
- code transform
- columnwise transform
- continuous Fourier transform
- coordinate system transform
- cosine transform
- C-transform
- CP-transform
- CPT-transform
- data transform
- direct electronic Fourier transform
- direct Fourier transform
- discrete cosine transform
- discrete Fourier transform
- discrete Hartley transform
- discrete Hilbert transform
- discrete Laplace transform
- F-transform
- fast Fourier transform
- fast Hartley transform
- fast polynomial transform
- fast Walsh transform
- Fermat transform
- Fourier transform
- fractal transform
- Fresnel transform
- Golay transform
- gradient transform
- H-transform
- Hadamard transform
- Hartley transform
- hexagonal discrete Fourier transform
- Hilbert transform
- homomorphic transform
- image transform
- indirect discrete cosine transform
- inverse transform
- inverse discrete Fourier transform
- inverse Fourier transform
- inverse Laplace transform
- joint transform
- Karhunen-Loève transform
- Laplace transform
- linear transform
- long-time Fourier transform
- Lorentz transform
- Mersenne transform
- mode transform
- multirate Z-transform
- near-to-far field transform
- nonlinear transform
- odd discrete Fourier transform
- odd-frequency Fourier transform
- odd-time Fourier transform
- odd-time odd-frequency discrete Fourier transform
- optical Fourier transform
- optical Fresnel transform
- P-transform
- Poisson transform
- polynomial transform
- Radon transform
- rowwise transform
- S-transform
- slant transform
- smoothed coherence transform
- Sommerfeld's transform
- T-transform
- Taylor-Cauchy transform
- two-dimensional Fourier transform
- two-dimensional Hartley transform
- twofold Fourier transform
- Walsh-Hadamard transform
- wavelet transform
- W/H transform
- Winograd discrete Fourier transform
- Z-transform -
5 быстрое преобразование Хартли
Русско-английский словарь по электронике > быстрое преобразование Хартли
-
6 быстрое преобразование Хартли
Русско-английский словарь по радиоэлектронике > быстрое преобразование Хартли
-
7 FHT
1) Медицина: fetal heart tones2) Военный термин: Formal Hardware Testing, field handling trainer4) Сокращение: fully heat-treated -
8 FHT
1. fast Hankel transform - быстрое преобразование Ганкеля;2. fast Hartley transform - быстрое преобразование Хартли;3. feed water holding tank - сборная ёмкость для питательной воды -
9 FHT
сокр. [fast Hartley transform] быстрое преобразование Хартли -
10 FHT
сокр. от fast Hartley transformбыстрое преобразование Хартли -
11 быстрое преобразование Хартли
Engineering: fast Hartley transformУниверсальный русско-английский словарь > быстрое преобразование Хартли
-
12 FHT
сокр. от fast Hartley transformEnglish-Russian dictionary of telecommunications and their abbreviations > FHT
См. также в других словарях:
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Fast Fourier Transform — Transformée de Fourier rapide La transformée de Fourier rapide (sigle anglais : FFT ou Fast Fourier Transform) est un algorithme de calcul de la transformée de Fourier discrète (TFD). Sa complexité varie en avec le nombre de points n, alors… … Wikipédia en Français
Discrete Hartley transform — A discrete Hartley transform (DHT) is a Fourier related transform of discrete, periodic data similar to the discrete Fourier transform (DFT), with analogous applications in signal processing and related fields. Its main distinction from the DFT… … Wikipedia
Arithmetic complexity of the discrete Fourier transform — See Fast Fourier transform#Bounds on complexity and operation counts for a general summary of this issue.Bounds on the multiplicative complexity of FFTIn his PhD thesis in 1987 [1] , Michael Heidman focus on the arithmetic theory of complexity… … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… … Wikipedia
FHT — fast Hartley transform; fetal heart; fetal heart tone * * * FHT abbr fetal heart tone … Medical dictionary
FHT — • fast Hartley transform; • fetal heart; • fetal heart tone … Dictionary of medical acronyms & abbreviations
FHT — FHT, a three letter acronym, may refer to:*Female hose thread, a type of threaded pipe usually found on garden hoses that connects to the male hose thread *Fetal heart tones, the normal rate of which remains 120 160 during pregnancy *Fast Walsh… … Wikipedia
Transformee de Fourier rapide — Transformée de Fourier rapide La transformée de Fourier rapide (sigle anglais : FFT ou Fast Fourier Transform) est un algorithme de calcul de la transformée de Fourier discrète (TFD). Sa complexité varie en avec le nombre de points n, alors… … Wikipédia en Français
Transformée de Fourier rapide — La transformée de Fourier rapide (sigle anglais : FFT ou Fast Fourier Transform) est un algorithme de calcul de la transformée de Fourier discrète (TFD). Sa complexité varie en avec le nombre de points n, alors que la complexité du calcul de … Wikipédia en Français
